#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
int one=0,two=1000000001;
vector<int> three;
int first,second;
for(int i=0;i<n;i++)
{
cin >> first >> second;
if(first==1)
{
one=max(one,second);
}
else if(first==2)
{
two=min(two,second);
}
else
{
three.push_back(second);
}
}
//cout << one << ' ' << two << endl;
if(one>two)
{
cout << 0 << endl;
continue;
}
int res=two-one+1;
//cout << res << ' ';
for(int num:three)
if(num>=one && num<=two)
res--;
cout << res << endl;
}
return 0;
}
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |